A sequential coloring algorithm for finite sets
نویسندگان
چکیده
منابع مشابه
A sequential coloring algorithm for finite sets
Let X be a finite set and P a hereditary property associated with the subsets of X. A partition of X into n subsets each with property P is said to be a P-n-coloring of X. The minimum n such that a P-n-coloring of X exists is defined to be the P-chromatic number of X. In this paper we give a sequential coloring algorithm for P-coloring X. From the algorithm we then get a few upper bounds for th...
متن کاملColoring Some Finite Sets In
This note relates to bounds on the chromatic number χ(R) of the Euclidean space, which is the minimum number of colors needed to color all the points in R so that any two points at the distance 1 receive different colors. In [6] a sequence of graphs Gn in R n was introduced showing that χ(R) ≥ χ(Gn) ≥ (1 + o(1)) n 2 6 . For many years, this bound has been remaining the best known bound for the ...
متن کاملA new Simulated Annealing algorithm for the robust coloring problem
The Robust Coloring Problem (RCP) is a generalization of the well-known Graph Coloring Problem where we seek for a solution that remains valid when extra edges are added. The RCP is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. This problem has been proved as NP-hard and in instances larger than 30 vertices, meta-...
متن کاملA practical algorithm for [r, s, t]-coloring of graph
Coloring graphs is one of important and frequently used topics in diverse sciences. In the majority of the articles, it is intended to find a proper bound for vertex coloring, edge coloring or total coloring in the graph. Although it is important to find a proper algorithm for graph coloring, it is hard and time-consuming too. In this paper, a new algorithm for vertex coloring, edge coloring an...
متن کاملColoring finite subsets of uncountable sets
It is consistent for every 1 ≤ n < ω that 2 = ωn and there is a function F : [ωn] <ω → ω such that every finite set can be written at most 2 − 1 ways as the union of two distinct monocolored sets. If GCH holds, for every such coloring there is a finite set that can be written at least 1 2 ∑n i=1 ( n+i n )( n i ) ways as the union of two sets with the same color. 0 Introduction In [6] we proved ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1999
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(98)00340-9